“Divide et Impera”
نویسندگان
چکیده
منابع مشابه
Divide et Impera: Metareasoning for Large Ontologies
Ontologies have the nasty habit of growing in size and expressivity until all reasoners are at a loss to treat them in reasonable time. While it is widely known that the worst case complexity for OWL 2 DL reasoning is double exponential in time, but in fact most ontologies tend to be well behaved in practice, it is less well known that any ontology, left to itself, will grow until the worst OWL...
متن کاملScientific Realism and the Stratagema de Divide et Impera
In response to historical challenges, advocates of a sophisticated variant of scientific realism emphasize that theoretical systems can be divided into numerous constituents. Setting aside any epistemic commitment to the systems themselves, they maintain that we can justifiably believe those specific constituents that are deployed in key successful predictions. Stathis Psillos articulates an ex...
متن کاملA Divide et impera Algorithm for Optimal Pitch Stylization
We present OpS, a divide et impera algorithm to address the problem of pitch stylization as an optimization process in O(NlogN). We aim at balancing the quality of the stylized curve and its cost in terms of the number of control points used. We also investigate how the occurrence of prominent syllables can be exploited to obtain less expensive stylizations. Our tests show that the basic OpS al...
متن کاملRobust Exponential Worst Cases for Divide-et-Impera Algorithms for Parity Games
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its theoretical exponential worst-case complexity and the negative reputation as a poorly effective algorithm in practice, it has been shown to rank among the best techniques for the solution of such games. Also, it proved...
متن کاملDivide et Impera: Partitioning Unstructured Peer-to-Peer Systems to Improve Resource Location
Unstructured P2P systems exhibit a great deal of robustness and self-healing at the cost of reduced scalability. Resource location is performed using a broadcastlike process called flooding. The work presented in this paper comprises an effort to reduce the overwhelming volume of traffic generated by flooding, thus increasing the scalability of unstructured P2P systems. Using a simple hashbased...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1878
ISSN: 0028-0836,1476-4687
DOI: 10.1038/018142c0